Vector Reachability Problem in $\mathrm{SL}(2,\mathbb{Z})$
نویسندگان
چکیده
This paper is showing the solution for two open problems about decidability of vector reachability problem in a finitely generated semigroup of matrices from SL(2,Z) and the point to point reachability (over rational numbers) for fractional linear transformations, where associated matrices are form SL(2,Z). The approach of solving reachability problems is based on analysis of reachability paths between points following the translation of numerical reachability problems into computational and combinatorial problems on words and formal languages. 1998 ACM Subject Classification F.2.1 Numerical Algorithms and Problems
منابع مشابه
Matrix Semigroup Freeness Problems in $\mathrm{SL}(2,\mathbb{Z})$
In this paper we study decidability and complexity of decision problems on matrices from the special linear group SL(2,Z). In particular, we study the freeness problem: given a finite set of matrices G generating a multiplicative semigroup S, decide whether each element of S has at most one factorization over G. In other words, is G a code? We show that the problem of deciding whether a matrix ...
متن کاملVector Reachability Problem in SL(2, Z)
This paper solves two open problems about the decidability of the vector reachability problem over a finitely generated semigroup of matrices from SL(2,Z) and the point to point reachability (over rational numbers) for fractional linear transformations, where associated matrices are from SL(2,Z). The approach to solving reachability problems is based on the characterization of reachability path...
متن کاملAn analog of Titchmarsh's theorem for the Dunkl transform in the space $mathrm{L}_{alpha}^{2}(mathbb{R})$
In this paper, using a generalized Dunkl translation operator, we obtain an analog of Titchmarsh's Theorem for the Dunkl transform for functions satisfying the Lipschitz-Dunkl condition in $mathrm{L}_{2,alpha}=mathrm{L}_{alpha}^{2}(mathbb{R})=mathrm{L}^{2}(mathbb{R}, |x|^{2alpha+1}dx), alpha>frac{-1}{2}$.
متن کاملTotal Variation Asymptotics for Sums of Independent Integer Random Variables
Let $W_n := \sum_{j=1}^n Z_j$ be a sum of independent integer-valued random variables. In this paper, we derive an asymptotic expansion for the probability $\mathbb{P}[W_n \in A]$ of an arbitrary subset $A \in \mathbb{Z}$. Our approximation improves upon the classical expansions by including an explicit, uniform error estimate, involving only easily computable properties of the distributions of...
متن کاملReachability Problems for Products of Matrices in Semirings
We consider the following matrix reachability problem: given r square matrices with entries in a semiring, is there a product of these matrices which attains a prescribed matrix? We define similarly the vector (resp. scalar) reachability problem, by requiring that the matrix product, acting by right multiplication on a prescribed row vector, gives another prescribed row vector (resp. when multi...
متن کامل